Constraint preconditioners for solving singular saddle point problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Inexact Constraint Preconditioners for Saddle Point Problems

In this paper we propose a parallel implementation of the FSAI preconditioner to accelerate the PCG method in the solution of symmetric positive definite linear systems of very large size. This preconditioner is used as building block for the construction of an indefinite Inexact Constraint Preconditioner (ICP) for saddle point-type linear systems arising from Finite Element (FE) discretization...

متن کامل

Preconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *

We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...

متن کامل

Using constraint preconditioners with regularized saddle-point problems

The problem of finding good preconditioners for the numerical solution of a certain important class of indefinite linear systems is considered. These systems are of a 2 by 2 block structure in which the (2,2) block (denoted by −C) is assumed to be nonzero. In Constraint preconditioning for indefinite linear systems, SIAM J. Matrix Anal. Appl., 21 (2000), Keller, Gould and Wathen introduced the ...

متن کامل

General constraint preconditioning iteration method for singular saddle-point problems

For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...

متن کامل

Analysis of Preconditioners for Saddle-Point Problems

Analysis of pre onditioners for saddle-point problems D. Loghin and A. J. Wathen Mixed nite element formulations give rise to large, sparse, blo k linear systems of equations the solution of whi h is often sought via a pre onditioned iterative te hnique. In this work we present a general analysis of blo kpre onditioners based on the stability onditions inherited from the formulation of the nite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2013

ISSN: 0377-0427

DOI: 10.1016/j.cam.2012.08.025